An optimum vehicular path algorithm for traffic network based on hierarchical spatial reasoning
نویسندگان
چکیده
منابع مشابه
Row/Column-First: A Path-based Multicast Algorithm for 2D Mesh-based Network on Chips
In this paper, we propose a new path-based multicast algorithm that is called Row/Column-First algorithm. The proposed algorithm constructs a set of multicast paths to deliver a multicast message to all multicast destination nodes. The set of multicast paths are all of row-first or column-first subcategories to maximize the multicast performance. The selection of row-first or column-first appro...
متن کاملShortest Path Routing Algorithm for Hierarchical Interconnection Network-on-Chip
Interconnection networks play a significant role in efficient on-chip communication for multicore systems. This paper introduces a new interconnection topology called the Hierarchical Cross Connected Recursive network (HCCR) and a shortest path routing algorithm for the HCCR. Proposed topology offers a high degree of regularity, scalability, and symmetry with a reduced number of links and node ...
متن کاملAn Optimum Vehicular Path Solution with Multi-heuristics
Heuristics have been widely used in artificial intelligence related fields including path finding. In this paper, the author argue that different heuristics can be integrated to solve the path finding problems and set forward a solution integrating greedy heuristic, directional heuristic and hierarchical heuristic. In greedy heuristic, an improved Dijkstra’s algorithm based on quad heap is set ...
متن کاملA New Routing Algorithm for Vehicular Ad-hoc Networks based on Glowworm Swarm Optimization Algorithm
Vehicular ad hoc networks (VANETs) are a particular type of Mobile ad hoc networks (MANET) in which the vehicles are considered as nodes. Due to rapid topology changing and frequent disconnection makes it difficult to design an efficient routing protocol for routing data among vehicles. In this paper, a new routing protocol based on glowworm swarm optimization algorithm is provided. Using the g...
متن کاملA Coverage Based Decentralised Routing Algorithm for Vehicular Traffic Networks
We present a simple yet effective routing strategy inspired by coverage control, which delays the onset of congestion on traffic networks, by introducing a control parameter. The routing algorithm allows a trade-off between the congestion level and the distance to the destination. Numerical verification of the strategy is provided on a number of representative examples in SUMO, a well known mic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geo-spatial Information Science
سال: 2000
ISSN: 1009-5020,1993-5153
DOI: 10.1007/bf02829394